Generalized steinhaus graphs
نویسندگان
چکیده
A generalized Steinhaus graph of order n and type s is a graph with n vertices whose adjacency matrix (a i;j) satisses the relation a i;j =
منابع مشابه
Uniform Generalized Steinhaus Graphs Neal
In [1] it is shown that the rst order theory of almost all generalized Steinhaus graphs is identical to the rst order theory of almost all graphs where each generalized Steinhaus graph is given the same probability. A natural probability measure on generalized Steinhaus graphs is obtained by independently assigning a probability o f p for each entry in the generating string of the graph. With t...
متن کاملUniform generalized Steinhaus graphs
In [1] it is shown that the first order theory of almost all generalized Steinhaus graphs is identical to the first order theory of almost all where each generalized Steinhaus graph is given the same probability. A natural probability measure on generalized Steinhaus graphs is obtained by independently assigning a probability of p for each entry in the generating string of the graph. With this ...
متن کامل2-connected and 2-edge-connected Steinhaus graphs
The numbers of 2-connected and 2-edge-connected Steinhaus graphs with n vertices are determined for n¿ 6. The possible generating strings of 2-connected and 2-edge-connected Steinhaus graphs are classi0ed. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملCharacterizations of bipartite Steinhaus graphs
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion had previously been given for the number of bipartite Steinhaus graphs and we give two fascinating closed forms for this recursion. Also, we exhibit a lower bound, which is achieved infinitely often, for the number of ...
متن کاملParity-regular Steinhaus graphs
Steinhaus graphs on n vertices are certain simple graphs in bijective correspondence with binary {0,1}-sequences of length n−1. A conjecture of Dymacek in 1979 states that the only nontrivial regular Steinhaus graphs are those corresponding to the periodic binary sequences 110...110 of any length n − 1 = 3m. By an exhaustive search the conjecture was known to hold up to 25 vertices. We report h...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Journal of Graph Theory
دوره 20 شماره
صفحات -
تاریخ انتشار 1995